Minimum-norm fixed point of nonexpansive mappings with applications

The purpose of this paper is to present two new iterative algorithms to find the minimum norm fixed point of nonexpansive nonself-mappings in the framework of Hilbert spaces. The results presented in this paper improve and extend the corresponding ones announced by Yao and Xu [Yao Y, Xu HK. Iterative methods for finding minimum norm fixed point of mappings with applications. Optimization. 2011;60:645–658] and many others. Some applications to convex minimization and split feast problems(SFP) are also included.     

Strong approximation for ρ-mixing sequences

We establish strong invariance principles for sums of stationary ρ-mixing random variables with finite and infinite second moments under weaker mixing rates.Some earlier results are improved.As applications,some results of the law of the iterated logarithm with finite and infinite variance are obtained,also a conjecture raised by Shao in 1993 is solved.     

END样本最近邻密度估计的强相合速度

本文研究了扩展负相依(END)样本最近邻密度估计的强相合性问题.利用END序列的Bernstein型不等式和截尾的方法,获得了END样本最近邻密度估计的强相合速度,推广了NA样本和ND样本最近邻密度估计的相应结果.     

Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited

Consider a simple graph and its proper edge coloring c with the elements of the set . We say that c is neighbor set distinguishing (or adjacent strong) if for every edge , the set of colors incident with u is distinct from the set of colors incident with v. Let us then consider a stronger requirement and suppose we wish to distinguishing adjacent vertices by sums of their incident colors. In both problems the challenging conjectures presume that such colorings exist for any graph G containing no isolated edges if only . We prove that in both problems is sufficient. The proof is based on the Combinatorial Nullstellensatz, applied in the “sum environment.” In fact the identical bound also holds if we use any set of k real numbers instead of as edge colors, and the same is true in list versions of the both concepts. In particular, we therefore obtain that lists of length ( in fact) are sufficient for planar graphs.     

Asymptotically optimal neighbour sum distinguishing colourings of graphs

Consider a simple graph G = (V,E) and its proper edge colouring c with the elements of the set {1,2,…,k}. The colouring c is said to be neighbour sum distinguishing if for every pair of vertices u, v adjacent in G, the sum of colours of the edges incident with u is distinct from the corresponding sum for v. The smallest integer k for which such colouring exists is known as the neighbour sum distinguishing index of a graph and denoted by . The definition of this parameter, which makes sense for graphs containing no isolated edges, immediately implies that , where Δ is the maximum degree of G. On the other hand, it was conjectured by Flandrin et al. that for all those graphs, except for C₅. We prove this bound to be asymptotically correct by showing that . The main idea of our argument relays on a random assignment of the colours, where the choice for every edge is biased by so called attractors, randomly assigned to the vertices. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 776–791, 2015     

非齐次树上马氏链的若干强偏差定理

通过构造适当的非负鞅,将Doob鞅收敛定理应用于几乎处处收敛的研究,给出了一类非齐次树上马氏链场加权和滑动平均的若干强偏差定理.     

Estimation of rating classes and default probabilities in credit risk models with dependencies

Let Y = m(X) + ε be a regression model with a dichotomous output Y and a one‐step regression function m . In the literature, estimators for the three parameters of m , that is, the breakpoint θ and the levels a and b , are proposed for independent and identically distributed (i.i.d.) observations. We show that these standard estimators also work in a non‐i.i.d. framework, that is, that they are strongly consistent under mild conditions. For that purpose, we use a linear one‐factor model for the input X and a Bernoulli mixture model for the output Y . The estimators for the split point and the risk levels are applied to a problem arising in credit rating systems. In particular, we divide the range of individuals' creditworthiness into two groups. The first group has a higher probability of default and the second group has a lower one. We also stress connections between the standard estimator for the cutoff θ and concepts prevalent in credit risk modeling, for example, receiver operating characteristic. Copyright © 2014 John Wiley & Sons, Ltd.     

基于半经典近似研究费米气体的稳定性及顺磁性

基于半经典近似方法,给出重力场和强磁场共存下费米子的能谱.然后由泊松公式导出费米气体的热力学势函数.在此基础上,运用热力学关系式求解低温条件下系统的稳定性及磁化率的解析式,并通过数值模拟分析强磁场背景下重力场对稳定性及顺磁性的影响机制.     

Computation of electronic structure and magnetic properties of strongly correlated materials with LDA+DMFT method

In this review, we describe general ideas of the LDA+DMFT method which merges dynamical mean-field theory (DMFT) and density functional theory (in particular the local density approximation (LDA)). Nowadays, the LDA+DMFT computational scheme is the most powerful numerical tool for studying physical properties of real materials and chemical compounds. It incorporates the advantage of DMFT to treat the full range of local dynamical Coulomb correlations and the ability of band methods to describe material-specific band dispersion caused by the lattice periodicity. We briefly discuss underlying physical ideas of LDA+DMFT and its mathematical implementation. Then different algorithms applied to solution of the DMFT impurity problem are briefly described. We then give examples of successful applications of the LDA+DMFT method to study spectral and magnetic properties of recently synthesized compounds like pnictide superconductors as well as classic charge-transfer systems NiO and MnO.     

教学评一致性视域下金属单元复习课的实践*

分析金属知识在中考和教材中的地位,针对当前单元复习教学中存在的问题,依据教学评一致性原则,将“金属知识”的单元复习在“订书钉”为主要线索的探究活动中展开,以此激发学生的学习兴趣,优化学生单元知识结构,发展学生分析问题、解决问题的能力,同时提高学生对学科价值的认识。